package com.zhenti.z1;
//   https://www.bilibili.com/video/BV11L4y1s7i4?spm_id_from=333.999.0.0
public class heidong {
    public static void main(String[] args) {
        int[][] holes = {{2,2},{5,5}};
        int [] left = {0,0};
        int  right[] = {10,10};
    }
    //二分取值
    public int getMax(int[][] holes,int[] right){
        int low = 0;
        int high = right[0] > right[1] ? right[0] : right[1];

        int mid = 0;
        while (low <=  high){
            mid = (low +  high)>>1;
            if(canfly(mid)){
                if (!canfly(mid+1))return mid;
                low  = mid+1;
            }else {
                high = mid-1;
            }
        }
        return mid ;
    }
    public boolean canfly(int i){



        return true;
    }


}
